A novel heuristic algorithm for QoS-aware end-to-end service composition

نویسندگان

  • Yuan-sheng Luo
  • Yong Qi
  • Di Hou
  • Lin-feng Shen
  • Ying Chen
  • Xiao Zhong
چکیده

Many works have been carried out to find the efficient algorithms for QoS-aware service composition in recent years. Nevertheless, on one hand, some of these works only consider the local QoS attributes in Web services composition; on the other hand, some ideas derived from QoS selection algorithms for network routing are directly applied in service composition without any adaption. A service composition model with end-to-end QoS constraints has been presented in this paper. An improved heuristics HCE based on the observation of characteristic of end-to-end service composition is proposed as a novel solution. Simulation results reveal the better performance of proposed heuristic compared to the other two heuristics, HMCOP and generic CE algorithm. 2010 Elsevier B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Novel Methods For Determining QoS Parameters and Thresholds in End User's Service Level Agreement

Service level agreement (SLA) is a powerful tool to formalize the negotiation and agreement between the service provider and service seeker with the scope of service quality characteristics, compensations and tariffs. The service quality description is the main part of a SLA which can be characterized by the use of suitable and feasible quality of service (QoS) parameters. Determining suitable ...

متن کامل

Automatic QoS-aware Web Services Composition based on Set-Cover Problem

By definition, web-services composition works on developing merely optimum coordination among a number of available web-services to provide a new composed web-service intended to satisfy some users requirements for which a single web service is not (good) enough. In this article, the formulation of the automatic web-services composition is proposed as several set-cover problems and an approxima...

متن کامل

Ant Colony System Based Algorithm for QoS-Aware Web Service Selection

QoS-aware service selection is an active area of research on Web services composition. It is a complex combinatorial optimization problem, which solves how to find a best composition plan that maximizes user QoS requirement. This paper presents a QoS-aware Web service selection algorithm based on Ant Colony System. Firstly, a proposed Web Services Composition graph (WSC graph) is applied to mod...

متن کامل

Semantic Constraint and QoS-Aware Large-Scale Web Service Composition

Service-oriented architecture facilitates the running time of interactions by using business integration on the networks. Currently, web services are considered as the best option to provide Internet services. Due to an increasing number of Web users and the complexity of users’ queries, simple and atomic services are not able to meet the needs of users; and to provide complex services, it requ...

متن کامل

TSINGHUA SCIENCE AND TECHNOLOG Efficient Composition of Semantic Web Service with End-to-End QoS Optimization

The Efficiency of QoS-aware service composition is important since most of the service composition problems are known to be NP-hard. With the growing number of Web services, the service composition is like a decision problem on selecting services or/and execution plan to satisfy user’s end-to-end QoS requirement (e.g. response time, throughput). Composite services with same functionality may di...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computer Communications

دوره 34  شماره 

صفحات  -

تاریخ انتشار 2011